Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract)
نویسندگان
چکیده
We study the behavioural theory of a higher-order distributed calculus with private names and locations that can be passivated. For this language, we present a novel Labelled Transition System where higherorder inputs are symbolic agents that can perform a limited number of transitions, capturing the nature of passivation. Standard first-order weak bisimulation over this LTS coincides with contextual equivalence, and provides the first useful proof technique without a universal quantification over contexts for an intricate distributed language.
منابع مشابه
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation!
We study the behavioural theory of a higher-order distributed calculus with private names and locations that can be passivated. For this language, we present a novel Labelled Transition System where higher-order inputs are symbolic agents that can perform a limited number of transitions, capturing the nature of passivation. Standard first-order weak bisimulation over this LTS coincides with con...
متن کاملA Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract)
We study a higher-order concurrent language with cryptographic primitives, for which we develop a sound and complete, firstorder testing theory for the preservation of safety properties. Our theory is based on co-inductive set simulations over transitions in a first-order Labelled Transition System. This keeps track of the knowledge of the observer, and treats transmitted higher-order values in...
متن کاملNormal Bisimulations in Calculi with Passivation
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterizations of barbed congruence, such as the notion of normal bisimulation developed by Sangiorgi for the higherorder π-calculus, are difficult to obtain. In this paper, we study bisimulations in two simple higher-order calculi w...
متن کاملSound Bisimulations for Higher-Order Distributed Process Calculus
While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such systems modelled in the higher-order π-calculus with passivation (and restriction). Previous research for this calculus is limited to context bisimulations and nor...
متن کاملModal Characterization of Weak Bisimulation for Higher-order Processes (Extended Abstract)
Context bisimulation [12, 1] has become an important notion of behavioural equivalence for higher–order processes. Weak forms of context bisimulation are particularly interesting, because of their high level of abstraction. We present a modal logic for this setting and provide a characterization of a variant of weak context bisimulation on second–order processes. We show how the logic permits c...
متن کامل